On the Dry Sorting Machine, Leap-bound Picker; Sorting Mechanism and Application. (Part I).

Research on Workpiece Sorting System Based on Machine Vision Mechanism

This paper describes industrial sorting system, which is based on robot vision technology, introduces main image processing methodology used during development, and simulates algorithm with Matlab. Besides, we set up image processing algorithm library via C# program and realize recognition and location for regular geometry workpiece. Furthermore, we analyze camera model in vision algorithm libr...

Lower bound on comparison-based sorting algorithms

Quantum lower bound for sorting ∗

Needless to say, sorting, especially sorting by comparisons, has been a classical problem in computer science. Despite its enormous importance, the complexity, in terms of the number of comparisons needed, is simple to analyze. Straightforward information theoretical argument gives the tight lower bound of log2(n!), which is achieved by several simple sorting algorithms, for example, Insertion ...

A Lower Bound for Sorting

We prove an (lg 2 n= lg lg n) lower bound for the depth of n-input sorting networks based on the shuue permutation. The best previously known lower bound was the trivial (lg n) bound, while the best upper bound is given by Batcher's (lg 2 n)-depth bitonic sorting network. The proof technique employed in the lower bound argument may be of independent interest.

an ann and acoustic-based machine for sorting pistachio nuts

in this study, an intelligent system for sorting closed shell and open shell pistachio nuts, was designed and developed based on combined acoustic and artificial neural network (ann) techniques. the system included a microphone, pc, material handling equipment and an air reject pneumatic mechanism. the microphone, placed under the steel plate, received sound signals generated by the pistachio n...